Fixpoint games on continuous lattices
نویسندگان
چکیده
منابع مشابه
Games for Topological Fixpoint Logic
Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational structures based on Stone spaces, where the fixpoint operators are interpreted via clopen sets. We develop a game-theoretic semantics for this logic. First we i...
متن کاملThe Fixpoint-Iteration Algorithm for Parity Games
It is known that the model checking problem for the modal μ-calculus reduces to the problem of solving a parity game and vice-versa. The latter is realised by the Walukiewicz formulas which are satisfied by a node in a parity game iff player 0 wins the game from this node. Thus, they define her winning region, and any model checking algorithm for the modal μ-calculus, suitably specialised to th...
متن کاملFixpoint Theorem for Continuous Functions on Chain-Complete Posets
Let P be a non empty poset. Observe that there exists a chain of P which is non empty. Let I1 be a relational structure. We say that I1 is chain-complete if and only if: (Def. 1) I1 is lower-bounded and for every chain L of I1 such that L is non empty holds sup L exists in I1. One can prove the following proposition (1) Let P1, P2 be non empty posets, K be a non empty chain of P1, and h be a mo...
متن کاملThe Core of Games on Distributive Lattices
Cooperative games under precedence constraints have been introduced by Faigle and Kern [1] , [4] as a generalization of classical cooperative games. An important notion in cooperative game theory is the core of the game, as it contains the rational imputations for players. We propose two definitions for the core of a distributive game, the first one is called the precore and is a direct general...
متن کاملModel-Checking Games for Fixpoint Logics with Partial Order Models
We introduce model-checking games that allow local second-order power on sets of independent transitions in the underlying partial order models where the games are played. Since the interleaving semantics of such models is not considered, some problems that may arise when using interleaving representations are avoided and new decidability results for partial order models are achieved. The games...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2019
ISSN: 2475-1421
DOI: 10.1145/3290339